Binary LCD Codes and Self-Orthogonal Codes via Simplicial Complexes
نویسندگان
چکیده
منابع مشابه
Asymptotic Bound on Binary Self-Orthogonal Codes
We present two constructions for binary selforthogonal codes. It turns out that our constructions yield a constructive bound on binary self-orthogonal codes. In particular, when the information rate R = 1/2, by our constructive lower bound, the relative minimum distance δ ≈ 0.0595 (for GV bound, δ ≈ 0.110). Moreover, we have proved that the binary selforthogonal codes asymptotically achieve the...
متن کاملNew binary and ternary LCD codes
LCD codes are linear codes with important cryptographic applications. Recently, a method has been presented to transform any linear code into an LCD code with the same parameters when it is supported on a finite field with cardinality larger than 3. Hence, the study of LCD codes is mainly open for binary and ternary fields. Subfield-subcodes of $J$-affine variety codes are a generalization of B...
متن کاملConstruction of binary and ternary self-orthogonal linear codes
We construct new binary and ternary self-orthogonal linear codes. In order to do this we use an equivalence between the existence of a self-orthogonal linear code over a prime eld with a prescribed minimum distance and the existence of a solution of a certain system of Diophantine linear equations. To reduce the size of the system of equations we restrict the search for solutions to solutions w...
متن کاملOn Hermitian LCD codes from cyclic codes and their applications to orthogonal direct sum masking
Cyclic codes are an interesting type of linear codes and have wide applications in communication and storage systems due to their efficient encoding and decoding algorithms. It was proved that asymptotically good Hermitian LCD codes exist. The objective of this paper is to construct some cyclic Hermitian LCD codes over finite fields and analyse their parameters. The dimensions of these codes ar...
متن کامل1 Self Orthogonal Greedy Codes
In this paper, we examine greedily generated self orthogonal codes. We show that they are linear, and discuss several properties which they possess. We also look at specific examples of these codes.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: IEEE Communications Letters
سال: 2020
ISSN: 1089-7798,1558-2558,2373-7891
DOI: 10.1109/lcomm.2020.2982381